Distributed Backup through Information Dispersal
نویسندگان
چکیده
منابع مشابه
Distributed Content Backup and Sharing Using Social Information
This paper addresses the need for content sharing and backup in household equipped with a home gateway that stores, tags and manages the data collected by the home users. Our solution leverages the interaction between remote gateways in a social way, i.e., by exploiting the users’ social networking information, so that backup recipients are those gateways whose users are most likely to be inter...
متن کاملContent-aware Load Balancing for Distributed Backup
When backing up a large number of computer systems to many different storage devices, an administrator has to balance the workload to ensure the successful completion of all backups within a particular period of time. When these devices were magnetic tapes, this assignment was trivial: find an idle tape drive, write what fits on a tape, and replace tapes as needed. Backing up data onto deduplic...
متن کامل4 Erasure Codes for Information Backup
My main research interest is in the area of discrete mathematics and it’s application to computer science, and in particular, combinatorics, graph theory, coding theory, computational optimization, and networking. My PhD. thesis is in graph theory. Along with Dr. Ron Gould, I am looking at various Hamiltonicity problems: The existence of k edge-disjoint Hamiltonian cycles in bipartite graphs [6...
متن کاملEvaluating Information Dispersal Algorithms
The explosion in data acquisition and storage has led to the emergence of data-intensive applications that are used to process enormous quantity of information using methods such as the MapReduce paradigm. Data-Intensive Distributed File Systems (DI-DFS) have been designed to support these kinds of applications. These large-scale storage systems require faulttolerance mechanisms to handle failu...
متن کاملDistributed PLR-Based Backup Path Computation in MPLS Networks
In this article, we provide mechanisms enabling the backup path computation to be performed on-line and locally by the Points of Local Repair (PLRs), in the context of the MPLS-TE fast reroute. To achieve a high degree of bandwidth sharing, the Backup Path Computation Entities (BPCEs), running on PLRs, require the knowledge and maintenance of a great quantity of bandwidth information (non aggre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2006
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2004.11.046